Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
271	SEAProgram Monday, June 29th 8:00 8:50 9:00 Add to Reading List Source URL: sea2015.lip6.fr Language: English - Date: 2015-06-14 11:10:18 NP-complete problems Computational complexity theory Steiner tree problem Combinatorial optimization Shortest path problem Mathematical optimization Independent set Combinatorics Graph theory Book:Graph Theory
272	Recognizing k-equistable graphs in FPT time? Eun Jung Kim1 , Martin Milaniˇc2 , and Oliver Schaudt3 1 3 Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2015-02-26 04:11:59 Graph theory Graph operations NP-complete problems Graph coloring Cograph Clique Matching Pathwidth
273	Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one Add to Reading List Source URL: www2.informatik.hu-berlin.de Language: English - Date: 2014-06-25 03:14:23 Computational complexity theory Theory of computation Complexity classes Packing problems NP-complete problems Bin packing problem Approximation algorithms Polynomial-time approximation scheme Partition problem NP NC Time complexity
274	Analytical Approach to Parallel Repetition arXiv:1305.1979v2 [cs.CC] 15 May 2013 Irit Dinur∗ Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-05-16 00:51:18 NP-complete problems Mathematics Generalised Whitehead product Homotopy theory Unique games conjecture
275	Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:23 Graph theory Mathematics Computational complexity theory NP-complete problems Dominating set Independent set Vertex cover Connected dominating set Set cover problem Line graph Metric k-center Domatic number
276	December 15, :20 WSPC - Proceedings Trim Size: 9.75in x 6.5in Add to Reading List Source URL: www.jsbi.org Language: English - Date: 2008-12-14 21:22:09 Graph theory Mathematics Computational complexity theory NP-complete problems Clique Subgraph isomorphism problem Matching Protein kinase Protein Root-mean-square deviation of atomic positions
277	Solution Quality and Efficiency in Discrete Optimization 2 Scientific Work Add to Reading List Source URL: www.ite.ethz.ch Language: English - Date: 2008-10-23 07:55:26 Computational complexity theory Mathematics Theory of computation Operations research NP-complete problems Mathematical optimization Convex optimization Travelling salesman problem Approximation algorithm Optimization problem Algorithm Genetic algorithm
278	On the Computational Complexity of ReoptimizationScientific Work Add to Reading List Source URL: www.ite.ethz.ch Language: English - Date: 2008-10-23 07:53:58 Computational complexity theory Approximation algorithms NP-complete problems Complexity classes Theoretical computer science Travelling salesman problem APX Optimization problem Combinatorial optimization Genetic algorithm Heuristic Steiner tree problem
279	EUROGRAPHICS ’M. Gross and F.R.A. Hopgood (Guest Editors) Volume 19, (2000), Number 3 Context-based Space Filling Curves Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2005-07-23 15:49:26 Mathematics Graph theory Computational complexity theory Fractal curves Television technology NP-complete problems Spanning tree Computer graphics Hilbert curve Space-filling curve Curve Peano curve
280	Magnús Már Halldórsson ICE-TCS, School of Computer Science Reykjavik University 101 Reykjavik, Iceland Add to Reading List Source URL: www.ru.is Language: English - Date: 2016-01-22 09:24:33 Computational complexity theory NP-complete problems Combinatorial optimization Theoretical computer science Maximum cut Approximation algorithm International Colloquium on Automata Languages and Programming Algorithmica Halldrsson International Symposium on Algorithms and Computation European Symposium on Algorithms Graph coloring

UPDATE